A Novel Particle Swarm Optimization with Passive Congregation via Chaotic Sequences
نویسندگان
چکیده
منابع مشابه
A Novel Hybrid Clustering Algorithms with Chaotic Particle Swarm Optimization ⋆
In order to overcome the premature convergence in the particle swarm optimization algorithm, dynamically chaotic perturbation is introduced to form a dynamically chaotic PSO, briefly denoted as DCPSO. To get rid of the drawbacks of simply finding the convex cluster and being sensitive to the initial partitions in k -means algorithm, a novel hybrid clustering algorithm combined with the DCPSO is...
متن کاملDamage detection of skeletal structures using particle swarm optimizer with passive congregation (PSOPC) algorithm via incomplete modal data
This paper uses a PSOPC model based non-destructive damage identification procedure using frequency and modal data. The objective function formulation for the minimization problem is based on the frequency changes. The method is demonstrated by using a cantilever beam, four-bay plane truss and two-bay two-story plane frame with different scenarios. In this study, the modal data are provided nume...
متن کاملEconomic Design of Retaining Wall Using Particle Swarm Optimization with Passive Congregation
This paper presents an effective optimization method for nonlinear constrained optimization of retaining structures. The proposed algorithm is based on the particle swarm optimization with passive congregation. The optimization procedure controls all geotechnical and structural design constraints while reducing the overall cost of the retaining wall. To applying the constraints, the algorithm e...
متن کاملA novel chaotic particle swarm optimization based fuzzy clustering algorithm
Clustering is a popular data analysis and data mining technique. In this paper, a novel chaotic particle swarm fuzzy clustering (CPSFC) algorithm based on chaotic particle swarm (CPSO) and gradient method is proposed. Fuzzy clustering model optimization is challenging, in order to solve this problem, adaptive inertia weight factor (AIWF) and iterative chaotic map with infinite collapses (ICMIC)...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer and Electrical Engineering
سال: 2012
ISSN: 1793-8163
DOI: 10.7763/ijcee.2012.v4.610